On the Performance Gap between a Task Schedule and its Corresponding Parallel Program

نویسندگان

  • Noriyuki Fujimoto
  • Takashi Hashimoto
  • Masahiro Mori
  • Kenichi Hagihara
چکیده

Consider a task scheduling problem of a given fine grained task graph on distributed-memory parallel machines. In this paper, we report that schedules with small makespan generated by existing task scheduling algorithms do not usually become fast parallel programs on distributed-memory parallel machines. That is caused by no consideration to message packaging. To obtain fast parallel programs using a task scheduling algorithm, it is important to develop algorithms to generate schedules which can apply message packaging. Then, we propose a task scheduling algorithm BSPH (Bulk Synchronous Parallel scheduling Heuristic). It is an algorithm which enables parallel programs based on the generated schedules to package messages. We also evaluate BSPH to confirm that BSPH is effective in fine grained task scheduling on distributed-memory parallel machines.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Message Packaging in Task Scheduling for Distributed Memory Parallel Machines

In this paper, we report a performance gap between a schedule with small makespan on the task scheduling model and the corresponding parallel program on distributed memory parallel machines. The main reason of the gap is the software overhead in the interprocessor communication. Therefore, speedup ratios of schedules on the model do not approximate well to those of parallel programs on the mach...

متن کامل

A Task Scheduling Algorithm to Package Messages on Distributed Memory Parallel Machines

In this paper, we report a performance gap between a schedule with good makespan on the task scheduling model and the corresponding parallel program on distributed memory parallel machines. The main reason is the software overhead in the interprocessor communication. Therefore, speedup ratios of schedules on the model do not well approximate to those of parallel programs on the machines. The pu...

متن کامل

A fixed and flexible maintenance operations planning optimization in a parallel batch machines manufacturing system

Scheduling has become an attractive area for artificial intelligence researchers. On other hand, in today's real-world manufacturing systems, the importance of an efficient maintenance schedule program cannot be ignored because it plays an important role in the success of manufacturing facilities. A maintenance program may be considered as the heath care of manufacturing machines and equipments...

متن کامل

The Effects of Task Complexity on English Language Learners’ Listening Comprehension

This article reports on the findings of a study that investigated the impact of manipulating task performance conditions on listening task performance by learners of English as a foreign language (EFL). The study was designed to explore the effects of changing complexity dimensions on listening task performance and to achieve two aims: to see how listening comprehension task performance was aff...

متن کامل

Green Energy-aware task scheduling using the DVFS technique in Cloud Computing

Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999